The Israeli Queue with Priorities
نویسندگان
چکیده
We consider a 2-class, single-server, preemptive priority queueing model in which the high-priority customers form a classical M/M/1 queue, while the low-priority customers form the so-called Israeli Queue with at most N different groups and unlimited-size batch service. We provide an extensive probabilistic analysis and calculate key performance measures. Special cases are analyzed and numerical examples are presented and discussed.
منابع مشابه
The Israeli queue with retrials
The so-called “Israeli queue” (Boxma et al. in Stoch Model 24(4):604– 625, 2008; Perel and Yechiali in Probab Eng Inf Sci, 2013; Perel and Yechiali in Stoch Model 29(3):353–379, 2013) is a multi-queue polling-type system with a single server. Service is given in batches, where the batch sizes are unlimited and the service time of a batch does not depend on its size. After completing service, th...
متن کاملThe Israeli Queue with a general group-joining policy
1 Abstract We consider a single-server multi-queue system with unlimited-size batch service 1 where the next queue to be served is the one with the most senior customer (the so called 2 ‘Israeli Queue’). We study a Markovian system with state-dependent group-joining policy 3 and derive results for various performance measures, such as steady-state distribution of 4 the number of groups in the s...
متن کاملOn the Batch Size and the Busy Period in the Finite ’Israeli Queue’
The Israeli Queue is a polling-type system with N groups (queues) and un-limited size batch service, where the next group to be served is the one with the most senior customer. For such a system we derive (i) the mean size of each group, and (ii) the Laplace-Stieltjes Transform and mean of the length of a busy period starting with n ≥ 1 groups. Numerical calculations are presented and the param...
متن کاملThe Israeli Queue with Finite and Infinite Number of Families
The so called ”Israeli Queue” is a single server polling system with batch service of an unlimited size, where the next queue to be visited is the one having the most senior waiting customer. The case with finite number of queues (families) was introduced in Boxma, Wal and Yechiali [2]. In this paper we extend the model to the case with a (possibly) infinite number of families. We analyze the M...
متن کاملThe Israeli Queue with Infinite Number of Groups
The so called “Israeli Queue” is a single server polling system with batch service of an unlimited size, where the next queue to be visited is the one in which the first customer in line has been waiting for the longest time. The case with finite number of queues (groups) was introduced by Boxma, Van der Wal and Yechiali [3]. In this paper we extend the model to the case with a (possibly) infin...
متن کامل